Upper Bounds for Stabilization in Acyclic Preference-Based Systems

نویسنده

  • Fabien Mathieu
چکیده

Preference-based systems (p.b.s.) describe interactions between nodes of a system that can rank their neighbors. Previous work has shown that p.b.s. converge to a unique locally stable matching if an acyclicity property is verified. In the following we analyze acyclic p.b.s. with respect to the self-stabilization theory. We prove that the round complexity is bounded by n2 for the adversarial daemon. The step complexity is equivalent to n 2 4 for the round robin daemon, and exponential for the general adversarial daemon.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of Observer-based H∞ Controller for Robust Stabilization of Networked Systems Using Switched Lyapunov Functions

In this paper, H∞ controller is synthesized for networked systems subject to random transmission delays with known upper bound and different occurrence probabilities in the both of feedback (sensor to controller) and forward (controller to actuator) channels. A remote observer is employed to improve the performance of the system by computing non-delayed estimates of the sates. The closed-loop s...

متن کامل

A new switching strategy for exponential stabilization of uncertain discrete-time switched linear systems in guaranteed cost control problem

Uncertain switched linear systems are known as an important class of control systems. Performance of these systems is affected by uncertainties and its stabilization is a main concern of recent studies. Existing work on stabilization of these systems only provides asymptotical stabilization via designing switching strategy and state-feedback controller. In this paper, a new switching strate...

متن کامل

Algebraic modelling and performance evaluation of acyclic fork-join queueing networks

Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join queueing networks are derived using a (max,+)algebra based representation of network dynamics. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented. Key-Words: (max,+)-algebra, dynamic state equation, acyclic fo...

متن کامل

UPPER BOUNDS FOR FINITENESS OF GENERALIZED LOCAL COHOMOLOGY MODULES

Let $R$ be a commutative Noetherian ring with non-zero identity and $fa$ an ideal of $R$. Let $M$ be a finite $R$--module of finite projective dimension and $N$ an arbitrary finite $R$--module. We characterize the membership of the generalized local cohomology modules $lc^{i}_{fa}(M,N)$ in certain Serre subcategories of the category of modules from upper bounds. We define and study the properti...

متن کامل

ROBUST $H_{infty}$ CONTROL FOR T–S TIME-VARYING DELAY SYSTEMS WITH NORM BOUNDED UNCERTAINTY BASED ON LMI APPROACH

In this paper we consider the problem of delay-dependent robustH1 control for uncertain fuzzy systems with time-varying delay. The Takagi–Sugeno (T–S) fuzzy model is used to describe such systems. Time-delay isassumed to have lower and upper bounds. Based on the Lyapunov-Krasovskiifunctional method, a sufficient condition for the existence of a robust $H_{infty}$controller is obtained. The fuzz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007